منابع مشابه
Dominance Constraints and Dominance Graphs
Dominance constraints logically describe trees in terms of their adjacency and dominance, i.e. reachability, relation. They have important applications in computational linguistics. Unfortunately, the satisfiability problem of dominance constraints is NP-complete. In this extended abstract we describe efficient algorithms for natural subclasses of dominance constraints [BDNM03]. The instances o...
متن کاملPure Dominance Constraints
We present an efficient algorithm that checks the satisfiability of pure dominance constraints, which is a tree description language contained in several constraint languages studied in computational linguistics. Pure dominance constraints partially describe unlabeled rooted trees. For arbitrary pairs of nodes they specify sets of admissible relative positions in a tree. The task is to find a t...
متن کاملGeneral Symmetry Breaking Constraints
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simultaneously on variables and values, conditional symmetries, as well as symmeties acting on set and other types of variables.
متن کاملDynamic Symmetry Breaking Constraints
We present a general method for dynamically posting symmetry breaking constraints during search. The basic idea is very simple. Given any set of symmetry breaking constraints, if during search a symmetry of one of these constraints is entailed and this is consistent with previously posted symmetry breaking constraints, then we post this constraint. We illustrate the method with two examples whe...
متن کاملSymmetry Breaking Ordering Constraints
In a constraint satisfaction problem (CSP), symmetry involves the variables, values in the domains, or both, and maps each search state into an equivalent one. When searching for solutions, symmetrically equivalent (partial) assignments can dramatically increase the search space. Hence, elimination of symmetry is essential to avoid exploring equivalent branches in a search tree. An important cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Constraints
سال: 2014
ISSN: 1383-7133,1572-9354
DOI: 10.1007/s10601-014-9173-7